منابع مشابه
On average sequence complexity
Subword complexity • The subword complexity c(x) of a string x is the number of distinct substrings of x (of any length) • Also called " complexity index " or " linguistic complexity " • Intuition: sequence with low complexity tend to be " repetitive " (easy to compress)
متن کاملOn the average-case complexity of Shellsort
We prove a lower bound expressed in the increment sequence on the average-case complexity (number of inversions which is proportional to the running time) of Shellsort. This lower bound is sharp in every case where it could be checked. We obtain new results e.g. determining the average-case complexity precisely in the Yao-Janson-Knuth 3-pass case.
متن کاملOn The Average-Case Complexity of Shellsort
We prove a lower bound expressed in the increment sequence on the average-case complexity (number of inversions which is proportional to the running time) of Shellsort. This lower bound is sharp in every case where it could be checked. We obtain new results e.g. determining the average-case complexity precisely in the Yao-Janson-Knuth 3-pass case.
متن کاملOn Average Bit Complexity of Interval Arithmetic
In many practical situations, we know only the intervals which contain the actual (unknown) values of physical quantities. If we know the intervals x for a quantity x and y for another quantity y, then, for every arithmetic operation , the set of possible values of x y also forms an interval; the operations leading from x and y to this new interval are called interval arithmetic operations. For...
متن کاملAverage Circuit Depth and Average Communication Complexity
We use the techniques of Karchmer and Widgerson KW90] to derive strong lower bounds on the expected parallel time to compute boolean functions by circuits. By average time, we mean the time needed on a self-timed circuit, a model introduced recently by Jakoby, Reischuk, and Schindelhauer, JRS94] in which gates compute their output as soon as it is determined (possibly by a subset of the inputs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.06.023